Probabilistic Description Logics
نویسنده
چکیده
On the one hand, class ical terminological knowledge representation excludes the possi bility of handling uncertain concept descrip tions involving, e.g., "usually true" concept properties, generalized quantifiers, or excep tions. On the other hand, purely numer ical approaches for handling uncertainty in general are unable to consider terminologi cal knowledge. This paper presents the lan guage At:CP which is a probabilistic extension of terminological logics and aims at closing the gap between the two areas of research. We present the formal semantics underlying the language At:CP and introduce the prob abilistic formalism that is based on class es of probabilities and is realized by means of probabilistic constraints. Besides infer ing implicitly existent probabilistic relation ships, the constraints guarantee terminologi cal and probabilistic consistency. Altogether, the new language .AirP applies to domains where both term descriptions and uncertain ty have to be handled.
منابع مشابه
Tractable Reasoning with Bayesian Description Logics
The DL-Lite family of tractable description logics lies between the semantic web languages RDFS and OWL Lite. In this paper, we present a probabilistic generalization of the DL-Lite description logics, which is based on Bayesian networks. As an important feature, the new probabilistic description logics allow for flexibly combining terminological and assertional pieces of probabilistic knowledg...
متن کاملComputing Subjective Expected Utility using Probabilistic Description Logics
We introduce a framework which is based on probabilistic Description logics (Prob-DL), to represent and solve multi-criteria discrete alternative problems by calculating expected utility. To our knowledge, this is the first ever approach for calculating expected utility using a Description logics based formalism.
متن کاملAn Algorithm for Learning with Probabilistic Description Logics
Probabilistic Description Logics are the basis of ontologies in the Semantic Web. Knowledge representation and reasoning for these logics have been extensively explored in the last years; less attention has been paid to techniques that learn ontologies from data. In this paper we report on algorithms that learn probabilistic concepts and roles. We present an initial effort towards semi-automate...
متن کاملLearning Probabilistic Ontologies with Distributed Parameter Learning
We consider the problem of learning both the structure and the parameters of Probabilistic Description Logics under DISPONTE. DISPONTE (“DIstribution Semantics for Probabilistic ONTologiEs”) adapts the distribution semantics for Probabilistic Logic Programming to Description Logics. The system LEAP for “LEArning Probabilistic description logics” learns both the structure and the parameters of D...
متن کاملTBox Reasoning in the Probabilistic Description Logic SHIQp
One shortcoming of classic Descriptions Logics, DLs, is their inability to encode probabilistic knowledge and reason over it. This is, however, a strong demand of some modern applications, e.g. in biology and healthcare. Therefore, probabilistic extensions of DLs are attracting attention nowadays. We introduce the probabilistic DL SHIQP which extends a known probabilistic DL. We investigate two...
متن کاملProbabilistic Description Logics for Subjective Uncertainty
We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern’s probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family of logics, concentrating on probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994